vertex transitive

См. также в других словарях:

• Vertex-transitive graph — In mathematics, a vertex transitive graph is a graph G such that, given any two vertices v1 and v2 of G , there is some automorphism : f : V(G) → V(G) such that : f (v1) = v2. In other words, a graph is vertex transitive if its automorphism group …   Wikipedia

• Vertex figure — In geometry a vertex figure is, broadly speaking, the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions theme and variationsTake some vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw …   Wikipedia

• Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… …   Wikipedia

• Transitive reduction — In mathematics, the transitive reduction of a binary relation R on a set X is a minimal relation R on X such that the transitive closure of R is the same as the transitive closure of R . If the transitive closure of R is antisymmetric and finite …   Wikipedia

• Distance-transitive graph — The Biggs Smith graph, the largest 3 regular distance transitive graph. Graph families defined by their automorphisms distance transitive …   Wikipedia

• Edge-transitive graph — In mathematics, an edge transitive graph is a graph G such that, given any two edges e 1 and e 2 of G , there is an automorphism of G that maps e 1 to e 2.In other words, a graph is edge transitive if its automorphism group acts transitively upon …   Wikipedia

• List of uniform polyhedra by vertex figure — There are many relations among the uniform polyhedron.Some are obtained by truncating the vertices of the regular or quasi regular polyhedron.Others share the same vertices and edges as other polyhedron.The grouping below exhibit some of these… …   Wikipedia

• Table of vertex symmetric digraphs — Table of the orders of the largest known vertex symmetric graphs for the directed Degree Diameter problem= Below is the table of the best known vertex transitive digraphs (as of October 2008) in the directed Degree diameter problem. The following …   Wikipedia

• Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) …   Wikipedia

• Hypergraph — An example hypergraph, with X = {v1,v2,v3,v4,v5,v6,v7} and E = {e1,e2,e3,e4} = {{v1,v2,v3}, {v2,v3} …   Wikipedia

• Semiregular 4-polytope — In geometry, a semiregular 4 polytope (or polychoron) is a 4 dimensional polytope which is vertex transitive (i.e. the symmetry group of the polytope acts transitively on the vertices) and whose cells are regular polyhedra. These represent a… …   Wikipedia